Construct optimized overlay multicast via preferential random walk
نویسندگان
چکیده
Tree depth and load balancing are two main metrics in overlay multicast network. Optimizing the two metrics with lightweight overhead is important for live media streaming. This paper proposes one scheme to construct optimized overlay multicast with short tree depth and load balancing via short random walk. The key idea is the preferential random walk based on fitness function in which the tree depth and load balancing metrics are defined as parameters with weighted coefficients. Simulations and experiments show that the fitness function is valid and optimized overlay network could be constructed via preferential random walk. We also find the local and global optimized results occur at some middle value of coefficient between 0 and 1, which is not consist with our intuitions that optimized result with single metric should occur at the boundary of coefficient(0 or 1.0).
منابع مشابه
Exploiting parallelism in the design of peer-to-peer overlays
Many peer-to-peer overlay operations are inherently parallel and this parallelism can be exploited by using multi-destination multicast routing, resulting in significant message reduction in the underlying network. We propose criteria for assessing when multicast routing can effectively be used, and compare multi-destination multicast and host group multicast using these criteria. We show that ...
متن کاملAssessing the Impact of Node Churn to Random Walk-Based Overlay Construction
Distributed systems desire to construct a random overlay graph for robustness, efficient information dissemination and load balancing. A random walk-based overlay construction is a promising alternative to generate an ideal random scale free overlay in distributed systems. However, a simple random walk-based overlay construction can be affected by node churn. Especially, the number of edges inc...
متن کاملSAAR: A Shared Control Plane for Overlay Multicast
Many cooperative overlay multicast systems of diverse designs have been implemented and deployed. In this paper, we explore a new architecture for overlay multicast: we factor out the control plane into a separate overlay that provides a single primitive: a configurable anycast for peer selection. This separation of control and data overlays has several advantages. Data overlays can be optimize...
متن کاملA Dynamic Mechanism for Distributed Optimization of Overlay Multicast Tree
To enhance the performance of overlay multicast networks, the overlay multicast tree should be optimized. This optimization problem is a minimum diameter, degree-limited spanning tree (MDDLST) problem which is known to be NP-Hard. We present a new scheme to optimize an overlay multicast tree dynamically. Our algorithm can adapt the tree structure to the dynamic membership and network situation....
متن کاملIssues in Overlay Multicast Networks: Dynamic Routing and Communication Cost
Overlay networks are becoming a popular vehicle for deploying advanced services in the Internet. One such service is multicast. Unlike conventional IP multicast, which requires universal deployment of network layer mechanisms, the overlay multicast model leverages the existing unicast mechanism and offers many service flexibilities to applications. Implementing multicast without requiring netwo...
متن کامل